Evolving Agent-based Models Using Complexification Approach

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolving Agent-based Models Using Complexification Approach

This paper focuses on parameter search for multi-agent based models using evolutionary algorithms. Large numbers and variable dimensions of parameters require a search method which can efficiently handle a high dimensional search space. We are proposing the use of complexification as it emulates the natural way of evolution by starting with a small constrained search space and expanding it as t...

متن کامل

Evolving agent-based models using self-adaptive complexification

This paper focuses on parameter search for multi-agent based models using evolutionary algorithms. Large numbers and variable dimensions of parameters require an optimization method which can efficiently handle a high dimensional search space. We are proposing the use of complexification as it emulates the natural way of evolution by starting with a small constrained search space and expanding ...

متن کامل

Evolving Artificial Neural Networks through Topological Complexification

This paper describes a novel methodology for evolving artificial neural network topologies by intelligently adding connections and neurons. The neural networks are complexified and grown to optimise their neural complexity, which is a measure of the information-theoretic complexity of the network. Complexification of neural networks describes the process of increasing the neural complexity whil...

متن کامل

Agent-based evolving societies

This paper describes a method to build artificial societies that can dynamically expand themselves from bottom-up, in order to cope with environmental changes. This method is then applied to model the evolutions through the first stages of human societies, inspired by social science theories.

متن کامل

Agent-based approach for cooperative scheduling

This paper studies the multi-factory production (MFP) network scheduling problem where a number of different individual factories join together to form a MFP network, in which these factories can operate more economically than operating individually. However, in such network which known as virtual production network with self-interested factories with transportation times, each individual facto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Computer Science

سال: 2014

ISSN: 1877-0509

DOI: 10.1016/j.procs.2014.05.028